Goedel - traduction vers français
Diclib.com
Dictionnaire ChatGPT
Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:

Traduction et analyse de mots par intelligence artificielle ChatGPT

Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:

  • comment le mot est utilisé
  • fréquence d'utilisation
  • il est utilisé plus souvent dans le discours oral ou écrit
  • options de traduction de mots
  • exemples d'utilisation (plusieurs phrases avec traduction)
  • étymologie

Goedel - traduction vers français

AUSTRIAN-AMERICAN LOGICIAN, MATHEMATICIAN, AND PHILOSOPHER OF MATHEMATICS (1906-1978)
Kurt Goedel; Gödel; Kurt Godel; Goedel; Gödel, K; Gödel, K.; Kurt gödel; K. Gödel; K. Goedel; Goedel, K; Goedel, K.; Godel, K.; Kurt godel; Godel, K; Kurt goedel; K. Godel; Kurt Friedrich Gödel; Godel; Religious views of Kurt Gödel
  • de}}, [[Vienna]], where he discovered his incompleteness theorems
  • Gravestone of Kurt and Adele Gödel in the Princeton, N.J., cemetery

Goedel      
Goedel, family name; Kurt Goedel (1906-1978), Czech logician and mathematician
Kurt Goedel      
Kurt Goedel (1906-1978), Czech mathematician and logician

Définition

Goedel
<language> (After the mathematician Kurt Godel) A declarative, general-purpose language for {artificial intelligence} based on logic programming. It can be regarded as a successor to Prolog. The type system is based on many-sorted logic with parametric polymorphism. Modularity is supported, as well as {infinite precision arithmetic} and finite sets. Goedel has a rich collection of system modules and provides constraint solving in several domains. It also offers metalogical facilities that provide significant support for metaprograms that do analysis, transformation, compilation, verification, and debugging. A significant subset of Goedel has been implemented on top of SISCtus Prolog by Jiwei Wang <jiwei@lapu.bristol.ac.uk>. FTP Bristol, UK (ftp://ftp.cs.bris.ac.uk/goedel), {FTP K U Leuven (ftp://ftp.cs.kuleuven.ac.be/pub/logic-prgm/goedel)}. E-mail: <goedel@compsci.bristol.ac.uk>. (1995-05-02)

Wikipédia

Kurt Gödel

Kurt Friedrich Gödel ( GUR-dəl, German: [kʊʁt ˈɡøːdl̩] (listen); April 28, 1906 – January 14, 1978) was a logician, mathematician, and philosopher. Considered along with Aristotle and Gottlob Frege to be one of the most significant logicians in history, Gödel had an immense effect upon scientific and philosophical thinking in the 20th century, a time when others such as Bertrand Russell, Alfred North Whitehead, and David Hilbert were using logic and set theory to investigate the foundations of mathematics, building on earlier work by the likes of Richard Dedekind, Georg Cantor and Frege.

Gödel's discoveries in the foundations of mathematics led to the proof of his completeness theorem in 1929 as part of his dissertation to earn a doctorate at the University of Vienna, and the publication of Gödel's incompleteness theorems two years later, in 1931. The first incompleteness theorem states that for any ω-consistent recursive axiomatic system powerful enough to describe the arithmetic of the natural numbers (for example, Peano arithmetic), there are true propositions about the natural numbers that can be neither proved nor disproved from the axioms. To prove this, Gödel developed a technique now known as Gödel numbering, which codes formal expressions as natural numbers. The second incompleteness theorem, which follows from the first, states that the system cannot prove its own consistency.

Gödel also showed that neither the axiom of choice nor the continuum hypothesis can be disproved from the accepted Zermelo–Fraenkel set theory, assuming that its axioms are consistent. The former result opened the door for mathematicians to assume the axiom of choice in their proofs. He also made important contributions to proof theory by clarifying the connections between classical logic, intuitionistic logic, and modal logic.